Data processing: speech signal processing – linguistics – language – Linguistics – Natural language
Patent
1996-03-18
2000-08-01
Isen, Forester W.
Data processing: speech signal processing, linguistics, language
Linguistics
Natural language
707530, 707540, G06F 1738
Patent
active
060980346
ABSTRACT:
A method for standardizing phrases in a document includes the steps of identifying phrases of a document to create a preliminary list of standard phrases; filtering the preliminary list of standard phrases to create a final list of standard phrases; identifying candidate phrases of the document which are similar to the standard phrases; confirming whether a candidate phrase of the document is sufficiently proximate to the standard phrase to constitute an approximate phrase; and computing a phrase substitution to determine the appropriate conformation of standard phrase to the approximate phrase or the approximate phrase to the standard. Further this invention relates to a computer system for standardizing a document.
REFERENCES:
patent: 5060154 (1991-10-01), Duncan, IV
patent: 5077668 (1991-12-01), Doi
patent: 5257186 (1993-10-01), Ukita et al.
patent: 5384703 (1995-01-01), Withgott et al.
patent: 5511159 (1996-04-01), Baker et al.
patent: 5627748 (1997-05-01), Baker et al.
patent: 5638543 (1997-06-01), Pedersen et al.
patent: 5640575 (1997-06-01), Maruyana et al.
Masek, William J. and Paterson, Michael S. (1980) "A Faster Algorithm Computing String Edit Distances", Journal of Computer and System Sciences 20:18-31 (Exhibit 1).
Sellers, Peter H. (1980) "The Theory and Computation of Evolutionary Distances: Pattern Recognition", Journal of Algorithms 1:359-373 (Exhibit 2).
Manber, Udi and Gene Meyers. (1993) "Suffix Arrays: A New Method for On-Line String Searches", SIAM J. Comput. 22:935-948 (Exhibit 3).
Ukkonen, Esko. (1992) "Approximate String-Matching with q-grams and Maximal Matches", Theoretical Computer Science, 92:191-211 (Exhibit 4).
Ukkonen, Esko. "Approximate-String-Matching Techniques Over Suffix Trees", Department and Computer Science, University of Helsinki, 229-242 (Exhibit 5).
Ukkonen, Esko and Derick Wood (1993) "Approximate String Matching With Suffix Automata", Algorithmica 10:353-364 (Exhibit 6).
Apostolico, A. and F.P. Preparata. (1983) "Optimal Off-Line Detection of Repetitions in a String", Theoretical Computer Science 22:297-315 (Exhibit 7).
Galil, Z. and R. Giancarlo. (1988) "Data Structures and Algorithms for Approximate String Matching", Journal of Complexity 4:33-72 (Exhibit 8).
Galil, Zvi and Raffaele Giancarlo. (1987) "Parallel String Matching with k Mismatches", Theoretical Computer 51:341-348 (Exhibit 9).
Galil, Zvi and Kunsoo Park. "An Improved Algorithm for Approximate String Matching", Department of Computer Science, Columbia University and Department of Computer Science, Tel-Aviv University 394-404 (Exhibit 10).
Jokinen, Petteri and Esko Ukkonen. "Two Algorithms for Approximate String Matching in Static Texts", Department of Computer Science, University of Helsinki 240-248 (Exhibit 11).
Knuth, Donald E. et al. (1977) "Fast Pattern Matching in Strings", SIAM J. Comput. 6:323-350 (Exhibit 12).
Landau, Gad M. and Uzi Vishkin. (1986) "Efficient String Matching with k Mismatches", Theoretical Computer Science 43:239-249 (Exhibit 13).
Tarhio, Jorma and Esko Ukkonen. (1993) "Approximate Boyer-Moore String Matching", SIAM J. Comput. 22:243-260 (Exhibit 14).
Tarhio, Jorma and Esko Ukkonen. "Boyer-Moore Approach to Approximate String Matching", Department of Computer Science, University of Helsinki, 348-359 (Exhibit 15).
Ukkonen, Esko. (1985) "Algorithms for Approximate String Matching", Department of Computer Science, University of Helsinki, 100-118 (Exhibit 16).
Ukkonen, Esko. (1985) "Finding Approximate Patterns in Strings", Journal of Algorithms, 6:132-137(Exhibit 17).
Ukkonen, Esko. "On Approximate String Matching", Department of Computer Science, University of Helsinki, 487-195 (Exhibit 18).
Weiner, Peter. "Linear Pattern Matching Algorithms", The Rand Corporation, Santa Monica, California, 1-11 (Exhibit 19).
Wagner, Robert A. and Michael J. Fischer. (1974) "The String-to-String Correction Problem", Journal of the Association for Computing Machinery, 21:168-173 (Exhibit 20).
Lowrance, Roy and Robert A. Wagner. (1975) "An Extension of the String-to-String Correction Problem", Journal of the Association for Computing Machinery, 22:177-183 (Exhibit 21).
Andersson, Arne, et al. (1995) "Suffix Trees on Words", Department of Computer Science, Lund University, 1-14 (Exhibit 22).
Andersson, Arne and Stefan Nillson. (1995) "Efficient implementation of Suffix Trees", Software-Practice and Experience, 25:129-141 (Exhibit 23).
McCreight, Edward M. (1976) "A Space-Economical Suffix Tree Construction Algorithm", Journal of the Association for Computing Machinery, 23:262-272 (Exhibit 24).
Fox, Christopher. "Lexical Analysis and Stoplists", AT&T Bell Laboratories, 102-130 (Exhibit 25).
Frakes, W.B. "Stemming Algorithms", Software Engineering Guild, 131-160 (Exhibit 26).
Boyer, Robert S. and J. Strother Moore. (1977) "A Fast String Searching Algorithm", Communications of the ACM, 20:762-772 (Exhibit 27).
Engelson Sean P.
Razin Ely Y.
Edouard Patrick N.
Expert Ease Development, Ltd.
Isen Forester W.
LandOfFree
Method for standardizing phrasing in a document does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for standardizing phrasing in a document, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for standardizing phrasing in a document will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-673255