Bi-dimensional rewriting rules for natural language processing

Details Bi-dimensional rewriting rules for natural language processing Bi-dimensional rewriting rules for natural language processing

2004-12-21

2010-10-26

Hudspeth, David R (Department: 2626)

Data processing: speech signal processing, linguistics, language

Linguistics

Natural language

C704S001000, C715S255000, C715S257000, C707S736000

Reexamination Certificate

active

07822597

ABSTRACT:
A linguistic rewriting rule for use in linguistic processing of an ordered sequence of linguistic tokens includes a token pattern recognition rule that matches the ordered sequence of linguistic tokens with a syntactical pattern. The token pattern recognition rule incorporates a character pattern recognition rule to match characters contained in an ambiguous portion of the ordered sequence of linguistic tokens with a character pattern defining a corresponding portion of the syntactical pattern.

REFERENCES:
patent: 5410475 (1995-04-01), Lu et al.
patent: 5642522 (1997-06-01), Zaenen et al.
patent: 5799269 (1998-08-01), Schabes et al.
patent: 5864789 (1999-01-01), Lieberman et al.
patent: 6393389 (2002-05-01), Chanod et al.
patent: 6405162 (2002-06-01), Segond et al.
patent: 6598015 (2003-07-01), Peterson et al.
patent: 2003/0074187 (2003-04-01), Ait-Mokhtar et al.
patent: 2005/0065776 (2005-03-01), Coden et al.
Piskorski et al., Piskorski, An Intelligent Text Extraction and Navigation System, Nov. 5, 1999, Proceedings of the RIAO-2000, pp. 1-24.
Koskenniemi, A General Computational Model For Worde-Form Recognition and Production, 1984, Association for Computational Linguistics, p. 178-181.
Aimelet, E., Lux, V., Jean, C., Segond, F., “WSD evaluation and the looking-glass”, Conference TALN 1999, Cargese, Jul. 12-17, 1999.
Ait-Mokhtar, S., Chanod, J-P., “Incremental Finite-State Parsing”, Proceedings of Applied Natural Language Processing 1997, Washington, DC, Apr. 1997.
Ait-Mokhtar, S., Chanod, J-P., “Subject and Object Dependency Extraction Using Finite-State Transducers”, Proceedings of the Workshop on Automatic Information Extraction and the Building of Lexical Semantic Resources, ACL, Madrid, Spain, 1997, p. 71-77.
Ait-Mokhtar, A., Chanod, J-P., Roux, C., “A Multi-Input Dependency Parser”, Seventh International Workshop on Parsing Technologies, Oct. 17-19, 2001, Beijing.
Ait-Mokhtar, S., Chanod, J-P., Roux, C., “Robustness Beyond Shallowness: Incremental Dependency Parsing”, Special Issue ofNatural Language Engineering, vol. 8, Nos. 2/3, 2002 Cambridge University Press, UK, p. 121-144.
Ballim, A., Coray G, A. Linden, A., and Vanoirbeek, C. The Use or Automatic Alignment on Structured Multilingual Documents. In J. Andre et H. Brown (editor), Electronic Publishing, Artistic Imaging, and Digital Typography: proceedings/Seventh International Conference on Electronic Publishing, EP'98 Document Manipulation and Typography, Saint-Malo, France, Apr. 1998. Springer-Verlag, p. 464-475.
Bauer, D., Segond, F., Zaenen, A., “LOCOLEX, the Translation Rolls off Your Tongue”, Proceedings of ACH-ALLC '95, Santa Barbara, CA, Jul. 11-15, 1995, p. 6-9.
Beesley, K.R., Karttunen, L., “Finite State Morphology”, CSLI Studies in Computational Linguistics, CSLI Publications, Stanford, CA 2003.
Bille, P., “Tree Edit Distance, Alignment Distance and Inclusion”, Technical Report TR-2003-23, IT University of Copenhagen, ISSN 1600-6100, Mar. 2003, ISBN 87-7949-032-8, p. 1-22.
Breidt, E., Segond, F., Valetto, G., “Formal Description of Multi-Word Lexemes with the Finite-State Formalism IDAREX”, Proceedings of COLING, Copenhagen, Aug. 5-9, 1995, p. 1036-1040.
Breidt, E., Segond, F., Valetto, G., “Local grammars for the description of multi-word lexemes and their automatic recognition in texts”, COMPLEX96, Budapest, Sep. 1996.
Bresnan, J., Kaplan, R.M., “Lexical-functional grammar: A formal system for grammatical representation”, The MIT Press Series on Cognitive Theory and Mental Repr., Cambridge, MA, 1982, p. 173-281.
Brill, E., “A simple rule-based part of speech tagger”, Third Annual Conference on Applied Natural Language Processing, ACL. 1992, p. 152-155.
Brun, C., “A client/server architecture for word sense disambiguation”, Proceedings of the 18thInternational Conference on Computational Linguistics (COLING 2000), Saarbrucken, Allemagne, Jul. 31-Aug. 4, 2000, p. 132-138.
Brun, C., Segond, F., “Semantic Encoding of Electronic Documents”,International Journal of Corpus Linguistic, vol. 6, No. 1, 2001.
Casillas, A., Abaitua, J., Martinez, R.; “DTD-Driven Bilingual Document Generation”, International Natural Language Generation Conference, Mitzpe Ramon, Israel, 2000, p. 32-38.
Casillas, A., Martinez, R., “Bitext segmentation and alignment for specialized document composition”,Traitement automatique de la langue(TAL), vol. 42—No. Feb. 2001, p. 441-458.
Chomsky, N., “Syntactic Structures”, Haag, Mouton, 1957.
Dini, L., DiTomaso, V., Segond, F., “Error Driven Word Sense Disambiguation”, Proceedings of COLING/ACL98, Montreal, Canada, 1998, p. 320-324.
Dini, L., DiTomaso, V., Segond, F., “GINGER II: An example-driven word sense disambiguator”,Computers and the Humanities, Special Issue on Senseval, vol. 34, No. 1-2, Apr. 2000, Kluwer Academic Publishers, The Netherlands, p. 121-126.
Fellbaum, C., “Wordnet: An Electronic Lexical Database”, The MIT Press, (Language, speech, and communication series), Cambridge, MA, 1998.
Gale, W.A., Church, K.W., “A Program for aligning sentences in bilingual corpora.” 29thAnnual Meeting of the Association for Computational Linguistics (ACL), Berkeley, CA, Jun. 1991, p. 177-184.
Gandrabur, S., Foster, G., “Confidence estimation for translation prediction”, Seventh Conference on Natural Language Learning, Edmonton, Canada, Jun. 2003.
Ide, N., Veronis, J., “Word Sense Disambiguation: The state of the art”, Computational Linguistics, vol. 24, No. 1, 1988.
Kupiec, J., “Robust part-of-speech tagging using a hidden Markov model”,Computer Speech and Language, vol. 6, 1992, p. 225-242.
Navarro, G., “A guided tour to approximate string matching”, ACM Computing Surveys, vol. 33 No. 1:31-88, 2001.
Navarro, G., Yates, R., Sutinen, E., Tarhio, J., “Indexing Methods for approximate string matching”, IEEE Data Engineering Bulletin, vol. 24 No. 4: 19-27, 2001.
Pereira, F. C. N., Warren, D.H.D., “Definite clause grammars for language analysis—a survey of the formalism and a comparison with augmented transition networks”,Artificial Intelligence, vol. 13, 1980, p. 231-278.
Poibeau, T., “Deconstructing Harry—une evaluation des systemes de reperage d-entites nommees”, Revue de Societe d'electronique, Thales, 2001.
Romary, L., Bonhomme, P., “Parallel alignment of structured documents”, Text Speech and Language Technology, Parallel Text Processing, 2000 Kluwer Academic Publishers, The Netherlands, p. 201-217.
Segond, F., Breidt, E., (Automatic (machine) Understanding of multiple word expressions in French and German) Comprehension automatique des expressions a mots multiples en francais et en allemand, Quatriemes Journees Scientifiques de Lyon, lexicomatique et Dictionairiques, Sep. 1995.
Vergne, J., Pages, P., “Synergy of syntax and morphology in automatic parsing of French language with a minimum of data, Feasibility study of the method”, Proceedings of COLING '86, Bonn, Aug. 25-29, 1986, p. 269-271.
U.S. Appl. No. 11/018,758, filed Dec. 21, 2004, Brun.
U.S. Appl. No. 11/018,891, filed Dec. 21, 2004, Lux-Pogodalla, et al.
Brun et al., “Intertwining deep syntactic processing and named entity detection,” Advances in Natural Language Processing, 4thInternational Conference, ESTAL 2004, pp. 195-206, 2004.
Hagege et al., “Advances in Natural Language Processing, Third International Conference, Portal 2002,” pp. 197-207, 2002.
Narayanaswamy et al., “A Biological Named Entity Recognizer,” Proceedings of the Pacific Symposium on Biocomputing, pp. 427-438, 2003.
Ait-Mokhtar et al., “Robustness Beyond Shallowness: Incremental Deep Parsing,” Natural Language Engineering, Cambridge University Press, vol. 8, No. 2/3, pp. 121-

Affiliated with

Also associated with

Rating

Bi-dimensional rewriting rules for natural language processing does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Bi-dimensional rewriting rules for natural language processing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bi-dimensional rewriting rules for natural language processing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4163236