Data processing: speech signal processing – linguistics – language – Linguistics – Natural language
Reexamination Certificate
2004-01-23
2010-02-02
Hudspeth, David R (Department: 2626)
Data processing: speech signal processing, linguistics, language
Linguistics
Natural language
C704S001000, C704S010000, C707S793000, C707S793000, C707S793000, C707S793000, C707S793000, C715S257000, C382S228000, C382S229000, C382S231000
Reexamination Certificate
active
07657422
ABSTRACT:
A method and system for generating a Directed Acyclic Graph (DAG) from an initial multi-chain, subject to a constraint. The initial multi-chain is expressed as a string serving as a current input string to which the constraint is subsequently applied. A provided string P expresses the constraint. P is applied to the current input string to generate at least one output string, wherein each generated output string violates the constraint to a lesser extent than does the input string or does not violate the constraint. Each generated output string violating the constraint serves as a current input string to which the constraint is subsequently applied. P is recursively applied to each current input string that had been determined from applying P previously, until applying P does not generate any more output strings violating the constraint. A set of the generated output strings not violating the constraint represents the DAG.
REFERENCES:
patent: 5708829 (1998-01-01), Kadashevich et al.
patent: 5963893 (1999-10-01), Halstead et al.
patent: 6023760 (2000-02-01), Karttunen
patent: 6032111 (2000-02-01), Mohri
patent: 6333999 (2001-12-01), Brownsmith
patent: 6553531 (2003-04-01), Kim et al.
patent: 6684201 (2004-01-01), Brill
patent: 6944588 (2005-09-01), Kempe
patent: 6947918 (2005-09-01), Brill
patent: 6990519 (2006-01-01), Fortenberry et al.
patent: 7010476 (2006-03-01), Karttunen et al.
patent: 7107205 (2006-09-01), Kempe
patent: 7257565 (2007-08-01), Brill
patent: 7383173 (2008-06-01), Mueller
patent: 2002/0165701 (2002-11-01), Lichtenberg et al.
“Compiling and Using Finite-State Syntactic Rules”, Kimmo Koskenniemi et al., Proc. of Coling-92, ′Online! Aug. 23, 1992-Aug. 28, 1992, pp. 156-162.
“The Replace Operator”, Lauri Karttunen, Finite State Language Processing, 1997, pp. 117-147.
Atro Voutilainen et al., “Ambiguity Resolution in a Reductionist Parser”, Sixth Conference of the European Chapter of the Association for Computational Linguistics, ′Online!! 1993, pp. 394-403.
Hudspeth David R
International Business Machines - Corporation
Schmeiser Olsen & Watts
Spooner Lamont M
Steinberg William H.
LandOfFree
System and method for text analysis does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for text analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for text analysis will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4230634