DOI: 10.1145/135239.135244. Fast text searching

Fast text searching

10.1145/135239.135244

Crossref journal-article

Association for Computing Machinery (ACM)

Communications of the ACM (320)

Bibliography

Wu, S., & Manber, U. (1992). Fast text searching. Communications of the ACM, 35(10), 83â91.

Authors 2

Sun Wu (first)
Udi Manber (additional)

References 23 Referenced 496

10.1137/0216067
10.1145/75334.75352
10.1145/359842.359859
10.1109/FSCS.1990.89530
10.1016/0885-064X(88)90008-8
10.1137/0219067
Gonnet , G.H. and Baeza .-Yates. R.A. Handbook of Algoritms and Data Structures . Second ed. Addison- Wesley, Reading , Mass ., 1991 . Gonnet, G.H. and Baeza.-Yates. R.A. Handbook of Algoritms and Data Structures. Second ed. Addison- Wesley, Reading, Mass., 1991. / Handbook of Algoritms and Data Structures by Gonnet G.H. (1991)
10.1145/356827.356830
Hopcroft , J.E. and U'llman , J.D. Introduction to Automata Theory, Languages. and Computational addison- Wesley , Reading , Mass , ( 1979 ), Hopcroft, J.E. and U'llman, J.D. Introduction to Automata Theory, Languages. and Computational addison- Wesley, Reading, Mass, (1979), / Reading by Hopcroft J.E. (1979)
10.1137/0206024
10.1016/0022-0000(88)90045-1
10.1016/0196-6774(89)90010-2
Levenshtein , V.I . Binary codes capable of correcting deletions, insertions, and reversals, Sov. Physs ., DokL ( Feb. 1966 ), 707 - 710 L Levenshtein, V.I. Binary codes capable of correcting deletions, insertions, and reversals, Sov. Physs., DokL (Feb. 1966), 707-710L / DokL / Binary codes capable of correcting deletions, insertions, and reversals, Sov. Physs by Levenshtein V.I (1966)
Manber , U. and Wu , S . Approximate string matching with arbitrary costs for text abd hypertext . IAPR Workshop on Structural and Syntatic Pattern. Recognition , ( Bern, Switzerland. Aug. 1992 ). Manber, U. and Wu, S. Approximate string matching with arbitrary costs for text abd hypertext. IAPR Workshop on Structural and Syntatic Pattern. Recognition, (Bern, Switzerland. Aug. 1992). / IAPR Workshop on Structural and Syntatic Pattern. Recognition by Manber U. (1992)
Manber U. and Wu S. Approximate pattern matching. BYTE. To be published Nov I992 Manber U. and Wu S. Approximate pattern matching. BYTE. To be published Nov I992
10.1007/BF01840446
10.1007/BF02458834
Pinter , R. Efficient string matching with don't-care patterns. In combinatorial Algoritms on Words , A. Apostolico and Z. Galil, Eds., Springer-Verlag , Berlin , 1985 . Pinter, R. Efficient string matching with don't-care patterns. In combinatorial Algoritms on Words, A. Apostolico and Z. Galil, Eds., Springer-Verlag, Berlin, 1985. / Efficient string matching with don't-care patterns. In combinatorial Algoritms on Words by Pinter R. (1985)
10.1016/0196-6774(85)90023-9
10.1016/S0019-9958(85)80046-2
Wagner , R.A. and Seiferas , J.I ., Correcting counter-automation-recognizable languages , SIAM J. Comput. ( 1978 ), 3357 - 3375 . Wagner, R.A. and Seiferas, J.I., Correcting counter-automation-recognizable languages, SIAM J. Comput. (1978), 3357-375. / SIAM J. Comput. ( / Correcting counter-automation-recognizable languages by Wagner R.A. (1978)
Wu , S. and Manber . U. Agrep-A fast approximate pattern-matching tool . Usenix Winter 1992 Technical Conference (San Francisco Jan. 1992), pp. 153 - 162 , Wu, S. and Manber. U. Agrep-A fast approximate pattern-matching tool. Usenix Winter 1992 Technical Conference (San Francisco Jan. 1992), pp. 153-162, / Usenix by Wu S. (1992)
Wu , S. , Manber , U. and Myers ,. E ,. W' ,. A Sub-Quadratic Algorithm for Approximate Regular Expression M:atching, submitted for publication (May 1992 ). Wu, S., Manber, U. and Myers,. E,.W',. A Sub-Quadratic Algorithm for Approximate Regular Expression M:atching, submitted for publication (May 1992). / A Sub-Quadratic Algorithm for Approximate Regular Expression M:atching, submitted for publication (May by Wu S. (1992)

Dates

Type	When
Created	23 years, 1 month ago (July 27, 2002, 7:37 a.m.)
Deposited	2 months, 2 weeks ago (June 18, 2025, 9:39 a.m.)
Indexed	1 month ago (July 30, 2025, 10:11 a.m.)
Issued	32 years, 11 months ago (Oct. 1, 1992)
Published	32 years, 11 months ago (Oct. 1, 1992)
Published Online	32 years, 11 months ago (Oct. 1, 1992)
Published Print	32 years, 11 months ago (Oct. 1, 1992)

Funders 0

None

BibTeX

@article{Wu_1992, title={Fast text searching: allowing errors}, volume={35}, ISSN={1557-7317}, url={http://dx.doi.org/10.1145/135239.135244}, DOI={10.1145/135239.135244}, number={10}, journal={Communications of the ACM}, publisher={Association for Computing Machinery (ACM)}, author={Wu, Sun and Manber, Udi}, year={1992}, month=oct, pages={83–91} }

JSON

{
  "indexed": {
    "date-parts": [
      [
        2025,
        7,
        30
      ]
    ],
    "date-time": "2025-07-30T14:11:44Z",
    "timestamp": 1753884704955,
    "version": "3.41.0"
  },
  "reference-count": 23,
  "publisher": "Association for Computing Machinery (ACM)",
  "issue": "10",
  "license": [
    {
      "start": {
        "date-parts": [
          [
            1992,
            10,
            1
          ]
        ],
        "date-time": "1992-10-01T00:00:00Z",
        "timestamp": 717897600000
      },
      "content-version": "vor",
      "delay-in-days": 0,
      "URL": "https://www.acm.org/publications/policies/copyright_policy#Background"
    }
  ],
  "content-domain": {
    "domain": [
      "dl.acm.org"
    ],
    "crossmark-restriction": true
  },
  "published-print": {
    "date-parts": [
      [
        1992,
        10
      ]
    ]
  },
  "DOI": "10.1145/135239.135244",
  "type": "journal-article",
  "created": {
    "date-parts": [
      [
        2002,
        7,
        27
      ]
    ],
    "date-time": "2002-07-27T11:37:49Z",
    "timestamp": 1027769869000
  },
  "page": "83-91",
  "update-policy": "https://doi.org/10.1145/crossmark-policy",
  "source": "Crossref",
  "is-referenced-by-count": 496,
  "title": "Fast text searching",
  "prefix": "10.1145",
  "volume": "35",
  "author": [
    {
      "given": "Sun",
      "family": "Wu",
      "sequence": "first",
      "affiliation": [
        {
          "name": "Bell Labs, Murray Hill, NJ"
        }
      ]
    },
    {
      "given": "Udi",
      "family": "Manber",
      "sequence": "additional",
      "affiliation": [
        {
          "name": "Univ. of Arizona, Tucson"
        }
      ]
    }
  ],
  "member": "320",
  "published-online": {
    "date-parts": [
      [
        1992,
        10
      ]
    ]
  },
  "reference": [
    {
      "key": "e_1_2_1_1_2",
      "doi-asserted-by": "publisher",
      "DOI": "10.1137/0216067"
    },
    {
      "key": "e_1_2_1_2_2",
      "doi-asserted-by": "publisher",
      "DOI": "10.1145/75334.75352"
    },
    {
      "key": "e_1_2_1_3_2",
      "doi-asserted-by": "publisher",
      "DOI": "10.1145/359842.359859"
    },
    {
      "key": "e_1_2_1_4_2",
      "doi-asserted-by": "publisher",
      "DOI": "10.1109/FSCS.1990.89530"
    },
    {
      "key": "e_1_2_1_5_2",
      "doi-asserted-by": "publisher",
      "DOI": "10.1016/0885-064X(88)90008-8"
    },
    {
      "key": "e_1_2_1_6_2",
      "doi-asserted-by": "publisher",
      "DOI": "10.1137/0219067"
    },
    {
      "key": "e_1_2_1_7_2",
      "volume-title": "Handbook of Algoritms and Data Structures",
      "author": "Gonnet G.H.",
      "year": "1991",
      "unstructured": "Gonnet , G.H. and Baeza .-Yates. R.A. Handbook of Algoritms and Data Structures . Second ed. Addison- Wesley, Reading , Mass ., 1991 . Gonnet, G.H. and Baeza.-Yates. R.A. Handbook of Algoritms and Data Structures. Second ed. Addison- Wesley, Reading, Mass., 1991."
    },
    {
      "key": "e_1_2_1_8_2",
      "doi-asserted-by": "publisher",
      "DOI": "10.1145/356827.356830"
    },
    {
      "key": "e_1_2_1_9_2",
      "volume-title": "Reading",
      "author": "Hopcroft J.E.",
      "year": "1979",
      "unstructured": "Hopcroft , J.E. and U'llman , J.D. Introduction to Automata Theory, Languages. and Computational addison- Wesley , Reading , Mass , ( 1979 ), Hopcroft, J.E. and U'llman, J.D. Introduction to Automata Theory, Languages. and Computational addison- Wesley, Reading, Mass, (1979),"
    },
    {
      "key": "e_1_2_1_10_2",
      "doi-asserted-by": "publisher",
      "DOI": "10.1137/0206024"
    },
    {
      "key": "e_1_2_1_11_2",
      "doi-asserted-by": "publisher",
      "DOI": "10.1016/0022-0000(88)90045-1"
    },
    {
      "key": "e_1_2_1_12_2",
      "doi-asserted-by": "publisher",
      "DOI": "10.1016/0196-6774(89)90010-2"
    },
    {
      "key": "e_1_2_1_13_2",
      "first-page": "707",
      "article-title": "Binary codes capable of correcting deletions, insertions, and reversals, Sov. Physs",
      "author": "Levenshtein V.I",
      "year": "1966",
      "unstructured": "Levenshtein , V.I . Binary codes capable of correcting deletions, insertions, and reversals, Sov. Physs ., DokL ( Feb. 1966 ), 707 - 710 L Levenshtein, V.I. Binary codes capable of correcting deletions, insertions, and reversals, Sov. Physs., DokL (Feb. 1966), 707-710L",
      "journal-title": "DokL"
    },
    {
      "key": "e_1_2_1_14_2",
      "volume-title": "IAPR Workshop on Structural and Syntatic Pattern. Recognition",
      "author": "Manber U.",
      "year": "1992",
      "unstructured": "Manber , U. and Wu , S . Approximate string matching with arbitrary costs for text abd hypertext . IAPR Workshop on Structural and Syntatic Pattern. Recognition , ( Bern, Switzerland. Aug. 1992 ). Manber, U. and Wu, S. Approximate string matching with arbitrary costs for text abd hypertext. IAPR Workshop on Structural and Syntatic Pattern. Recognition, (Bern, Switzerland. Aug. 1992)."
    },
    {
      "key": "e_1_2_1_15_2",
      "unstructured": "Manber U. and Wu S. Approximate pattern matching. BYTE. To be published Nov I992 Manber U. and Wu S. Approximate pattern matching. BYTE. To be published Nov I992"
    },
    {
      "key": "e_1_2_1_16_2",
      "doi-asserted-by": "publisher",
      "DOI": "10.1007/BF01840446"
    },
    {
      "key": "e_1_2_1_17_2",
      "doi-asserted-by": "publisher",
      "DOI": "10.1007/BF02458834"
    },
    {
      "key": "e_1_2_1_18_2",
      "volume-title": "Efficient string matching with don't-care patterns. In combinatorial Algoritms on Words",
      "author": "Pinter R.",
      "year": "1985",
      "unstructured": "Pinter , R. Efficient string matching with don't-care patterns. In combinatorial Algoritms on Words , A. Apostolico and Z. Galil, Eds., Springer-Verlag , Berlin , 1985 . Pinter, R. Efficient string matching with don't-care patterns. In combinatorial Algoritms on Words, A. Apostolico and Z. Galil, Eds., Springer-Verlag, Berlin, 1985."
    },
    {
      "key": "e_1_2_1_20_2",
      "doi-asserted-by": "publisher",
      "DOI": "10.1016/0196-6774(85)90023-9"
    },
    {
      "key": "e_1_2_1_21_2",
      "doi-asserted-by": "publisher",
      "DOI": "10.1016/S0019-9958(85)80046-2"
    },
    {
      "key": "e_1_2_1_22_2",
      "first-page": "3357",
      "article-title": "Correcting counter-automation-recognizable languages",
      "author": "Wagner R.A.",
      "year": "1978",
      "unstructured": "Wagner , R.A. and Seiferas , J.I ., Correcting counter-automation-recognizable languages , SIAM J. Comput. ( 1978 ), 3357 - 3375 . Wagner, R.A. and Seiferas, J.I., Correcting counter-automation-recognizable languages, SIAM J. Comput. (1978), 3357-375.",
      "journal-title": "SIAM J. Comput. ("
    },
    {
      "key": "e_1_2_1_24_2",
      "first-page": "153",
      "volume-title": "Usenix",
      "author": "Wu S.",
      "year": "1992",
      "unstructured": "Wu , S. and Manber . U. Agrep-A fast approximate pattern-matching tool . Usenix Winter 1992 Technical Conference (San Francisco Jan. 1992), pp. 153 - 162 , Wu, S. and Manber. U. Agrep-A fast approximate pattern-matching tool. Usenix Winter 1992 Technical Conference (San Francisco Jan. 1992), pp. 153-162,"
    },
    {
      "key": "e_1_2_1_25_2",
      "volume-title": "A Sub-Quadratic Algorithm for Approximate Regular Expression M:atching, submitted for publication (May",
      "author": "Wu S.",
      "year": "1992",
      "unstructured": "Wu , S. , Manber , U. and Myers ,. E ,. W' ,. A Sub-Quadratic Algorithm for Approximate Regular Expression M:atching, submitted for publication (May 1992 ). Wu, S., Manber, U. and Myers,. E,.W',. A Sub-Quadratic Algorithm for Approximate Regular Expression M:atching, submitted for publication (May 1992)."
    }
  ],
  "container-title": "Communications of the ACM",
  "original-title": [],
  "language": "en",
  "link": [
    {
      "URL": "https://dl.acm.org/doi/10.1145/135239.135244",
      "content-type": "unspecified",
      "content-version": "vor",
      "intended-application": "text-mining"
    },
    {
      "URL": "https://dl.acm.org/doi/pdf/10.1145/135239.135244",
      "content-type": "unspecified",
      "content-version": "vor",
      "intended-application": "similarity-checking"
    }
  ],
  "deposited": {
    "date-parts": [
      [
        2025,
        6,
        18
      ]
    ],
    "date-time": "2025-06-18T13:39:19Z",
    "timestamp": 1750253959000
  },
  "score": 1,
  "resource": {
    "primary": {
      "URL": "https://dl.acm.org/doi/10.1145/135239.135244"
    }
  },
  "subtitle": [
    "allowing errors"
  ],
  "short-title": [],
  "issued": {
    "date-parts": [
      [
        1992,
        10
      ]
    ]
  },
  "references-count": 23,
  "journal-issue": {
    "issue": "10",
    "published-print": {
      "date-parts": [
        [
          1992,
          10
        ]
      ]
    }
  },
  "alternative-id": [
    "10.1145/135239.135244"
  ],
  "URL": "http://dx.doi.org/10.1145/135239.135244",
  "relation": {},
  "ISSN": [
    "0001-0782",
    "1557-7317"
  ],
  "subject": [],
  "container-title-short": "Commun. ACM",
  "published": {
    "date-parts": [
      [
        1992,
        10
      ]
    ]
  },
  "assertion": [
    {
      "value": "1992-10-01",
      "order": 2,
      "name": "published",
      "label": "Published",
      "group": {
        "name": "publication_history",
        "label": "Publication History"
      }
    }
  ]
}