Modifying an input string partitioned in accordance with directi

Details Modifying an input string partitioned in accordance with directi Modifying an input string partitioned in accordance with directi

1997-05-16

2000-02-08

Kim, Kenneth S.

Electrical computers and digital processing systems: processing

Byte-word rearranging, bit-field insertion or extraction,...

704 9, 704 10, G06F 1720

Patent

active

060237600

ABSTRACT:
A processor implemented method of modifying a string of a regular language, which includes at least two symbols and at least two predetermined substrings. Upon receipt of the string, the processor determines an initial position within the string of a substring matching one of the preselected substrings. To make this determination, the processor either matches symbols of the string starting from the left and proceeding to the right or by starting from the right and proceeding to the left. After identifying the initial position, the processor then selects either the longest or the shortest of the preselected substrings. The processor then replaces the matching substring with the string of the lower language associated with the selected preselected substring and outputs the modified string.

REFERENCES:
patent: 5325091 (1994-06-01), Kaplan et al.
patent: 5410475 (1995-04-01), Lu et al.
patent: 5426779 (1995-06-01), Chambers, IV
patent: 5450598 (1995-09-01), Kaplan et al.
patent: 5511159 (1996-04-01), Baker et al.
patent: 5594641 (1997-01-01), Kaplan et al.
patent: 5625554 (1997-04-01), Cutting et al.
patent: 5721939 (1998-02-01), Kaplan
patent: 5754847 (1998-05-01), Kaplan et al.
Roche, E., "Analyse syntaxique transformationelle du francais par transducteurs et lexique-gramaire", Doctoral Dissertation, Universite Paris 7, 1993, pp. 136-156.
Silberztein, M., `Dictionnaires Electroniques et Analyse Automatique de textes--Le Systeme Intex`, Masson, Paris, France, 1993, pp. 154-167.
Schuzenberger, M.P., "Sur Une Variante Des Fonctions Squentielles," Theoretical Computer Science, 4, 1977, pp. 47-57.
Kempe, A., and Karttunen, L., "Parallel Replacement in Finite State Calculus", Proceedings of the Sixteenth International Conference on Computational Linguistics, Coling 96, 1996.
Karttunen, L., "Constructing Lexical Transducers", Proceedings of the Fifteenth International Conference on Computational Linguistics, Coling 94, 1994, pp. 406-411.
Horowitz, P., and Hill, W., The Art of Electronics, Second Ed., Cambridge: Cambridge University Press, 1989, pp. 673-678.
Mohri, M., "On Some Applications of Finite-State Automata Theory to Natural Language Processing", AT&T Bell Laboratories, Apr. 18, 1996.
Berstel, Dr. Jean. Transductions and Context-Free Languages, B.G. Teubner Stuttgart, Germany, 1979, pp. 77-80, 92-110, 114-123.
Chanod, Jean-Pierre and Pasi Tapanainen. "Tagging French-Comparing a Statistical and a Constraint-Based Method," In The Proceedings of the Seventh Conference of the European Chapter of the Association for Computational Linguistics, Dublin, Ireland, 1995, pp. 149-156.
Eilenberg, Samuel.. Automata, Languages, and Machines: Volume A, Academic Press, New York, 1974, pp. 266-295.
Gross, Maurice. "The Use of Finite Automata in the Lexical Representation of Natural Language," In Lecture Notes in Computer Science, Springer-Verlag, Berlin, Germany, 1989, pp. 34-50.
Hopcroft, John E. and Jeffrey D. Ullman. Introduction to Automat Theory, Languages, and Computation. Addison-Wesley Publishing Company, Inc., Menlo Park, CA, 1979, pp. 1-2 and 28-35.
Kaplan, Ronald M. and Martin Kay. "Regular Models of Phonological Rule Systems," Computational Linguistics, vol. 20, No. 3, 1994, pp. 331-378.
Karttunen, Lauri et al. "A Compiler for Two-Level Phonological Rules," In Report No. CSLI-87-108. Centre for the Study of Language and Information, Stanford University. Palo Alto, California, 1987, pp. 1-51.
Karttunen, Lauri. "The Replace Operator," In The Proceedings of the 33rd Annual Meeting of the Association for Computational Linguistics, ACL-94, Boston, Massachusetts, 1995,. pp. 16-23.
Roche, Emmanuel and Yves Schabes. "Deterministic Part-of-Speech Tagging with Finite-State Transducers," Computational Linguistics, vol. 21, no. 2, 1995, pp. 227-253.
Schutzenberger, M.P. "Sur Une Variante Des Fonctions Sequentielles," Theoretical Computer Science, 4, 1977, pp. 47-57 (In French).
Silberztein, Max. Dictionnaires Electoniques et Analyse Automatique de Textes, Masson, Paris, France, 1993, pp. 154-167 (In French).

Affiliated with

Also associated with

Rating

Modifying an input string partitioned in accordance with directi does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Modifying an input string partitioned in accordance with directi, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Modifying an input string partitioned in accordance with directi will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1689099