Proceedings of a workshop on held at Baltimore, Maryland October 13-15, 1998 -, 1996
John Smith]PERS?NAME 47]NUM was named]V G president]NG of]P ABC Corp]ORG?NAME The combiner phase ... more John Smith]PERS?NAME 47]NUM was named]V G president]NG of]P ABC Corp]ORG?NAME The combiner phase pieces together slightly larger constituents when it can be done reliably. John Smith, 47]PERS?NG was named]V G president of ABC Corp.]POS?NG
Proceedings of the 4th conference on Message understanding - MUC4 '92, 1992
ABSTRACT FASTUS is a (slightly permuted) acronym for Finite State Automaton Text Understanding Sy... more ABSTRACT FASTUS is a (slightly permuted) acronym for Finite State Automaton Text Understanding System. It is a system for extracting information from free text in English, and potentially other languages as well, for entry into a database, and potentially for other applications. It works essentially as a cascaded, nondeterministic finite state automaton.
Proceedings of the workshop on Speech and Natural Language - HLT '89, 1989
TACITUS is a general and domain-independent natural language processing system, used so far prima... more TACITUS is a general and domain-independent natural language processing system, used so far primarily for message processing. It performs a syntactic analysis of the sentences in the text, producing a logical form. Next, inferential pragmatics processing is applied to the logical form to solve problems of schema recognition, reference resolution, metonymy resolution, and the interpretation of vague predicates. An analysis component then produces the desired output for the application. TACITUS has been applied to several quite different domains, including naval equipment failure reports, naval operations reports, and terrorist reports.
SRI is developing a spoken language system (SLS) that should permit natural and efficient communi... more SRI is developing a spoken language system (SLS) that should permit natural and efficient communication with an air travel information system. SLS development at SRI divides roughly into three areas: speech recognition, natural language processing, and human interface design.The ...
Proceedings of the 31st annual meeting on Association for Computational Linguistics -, 1993
y 1. ABSTRACT Gemini is a natural language understanding system developed for spoken language app... more y 1. ABSTRACT Gemini is a natural language understanding system developed for spoken language applications. The paper describes the architecture of Gemini, paying particular attention to resolving the tension between robustness and overgeneration. Gemini features a broad-coverage uni cation-based grammar of English, fully interleaved syntactic and semantic processing in an all-paths, bottom-up parser, and an utterancelevel parser to nd interpretations of sentences that might not be analyzable as complete sentences. Gemini also includes novel components for recognizing and correcting grammatical dis uencies, and for doing parse preferences. This paper presents a component-by-component view of Gemini, providing detailed relevant measurements of size, e ciency, and performance.
ABSTRACT We describe the modification of a grammar to take advantage of prosodic information auto... more ABSTRACT We describe the modification of a grammar to take advantage of prosodic information automatically extracted from speech. The work includes (1) the development of an integer "break index" representation of prosodic phrase boundary information, (2) the automatic detection of prosodic phrase breaks using a hidden Markov model on relative duration of phonetic segments, and (3) the integration of the prosodic phrase break information in SRI's Spoken Language System to rule out alternative parses in otherwise syntactically ambiguous sentences. Initial experiments using ambiguous sentences read by radio announcers achieved good results in both detection and parsing. Automatically detected phrase break indices had a correlation greater than 0.86 with hand-labeled data for speaker-dependent models; and, in a subset of sentences with preposition ambiguities, the number of parses was reduced by 25% with a simple grammar modification.
We describe an approach to applying a particular kind of Natural Language Processing (NLP) system... more We describe an approach to applying a particular kind of Natural Language Processing (NLP) system to the TREC routing task in Information Retrieval (IR). Rather than attempting to use NLP techniques in indexing documents in a corpus, we adapted an information extraction (IE) system to act as a post-lter on the output of an IR system. The IE system was con gured to score each of the top 2000 documents as determined by an IR system and on the basis of that score to rerank those 2000 documents. One aim was to improve precision on routing tasks. Another was to make it easier to write IE grammars for multiple topics.
We describe an approach to applying a particular kind of Natural Language Processing (NLP) system... more We describe an approach to applying a particular kind of Natural Language Processing (NLP) system to the TREC routing task in Information Retrieval (IR). Rather than attempting to use NLP techniques in indexing documents in a corpus, we adapted an information extraction (IE) system to act as a post-lter on the output of an IR system. The IE system was con gured to score each of the top 2000 documents as determined by an IR system and on the basis of that score to rerank those 2000 documents. One aim was to improve precision on routing tasks. Another was to make it easier to write IE grammars for multiple topics.
We describe the modification of a grammar to take advantage of prosodic information provided by a... more We describe the modification of a grammar to take advantage of prosodic information provided by a speech recognition system. This initial study is limited to the use of relative duration of phonetic segments in the assignment of syntactic structure, specifically in ruling out alternative parses in otherwise ambiguous sentences. Taking advantage of prosodic information in parsing can make a spoken language system more accurate and more efficient, if prosodicsyntactic mismatches, or unlikely matches, can be pruned. We know of no other work that has succeeded in automatically extracting speech information and using it in a parser to rule out extraneous parses.
FASTUS is a (slightly permuted) acronym for Finite State Automaton Text Understanding System. It ... more FASTUS is a (slightly permuted) acronym for Finite State Automaton Text Understanding System. It is a system for extracting information from free text in English, and potentially other languages as well, for entry into a database, and potentially for other applications. It works essentially as a cascaded, nondeterministic finite state automaton.
... system is the best approach to the text information extraction problem, and that the technolo... more ... system is the best approach to the text information extraction problem, and that the technology is now rip e for application to real-world problems . Our experience has shown that ... [1] Appelt, Douglas, Jerry Hobbs, John Bear, David Israel, and Mabry Tyson . FASTUS: a finite-state ...
This paper describes a morphological analyzer which, when parsing a word, uses two sets of rules:... more This paper describes a morphological analyzer which, when parsing a word, uses two sets of rules: rnles describing the syntax of words, and rules describing facts about orthography.
Proceedings of a workshop on held at Baltimore, Maryland October 13-15, 1998 -, 1996
John Smith]PERS?NAME 47]NUM was named]V G president]NG of]P ABC Corp]ORG?NAME The combiner phase ... more John Smith]PERS?NAME 47]NUM was named]V G president]NG of]P ABC Corp]ORG?NAME The combiner phase pieces together slightly larger constituents when it can be done reliably. John Smith, 47]PERS?NG was named]V G president of ABC Corp.]POS?NG
Proceedings of the 4th conference on Message understanding - MUC4 '92, 1992
ABSTRACT FASTUS is a (slightly permuted) acronym for Finite State Automaton Text Understanding Sy... more ABSTRACT FASTUS is a (slightly permuted) acronym for Finite State Automaton Text Understanding System. It is a system for extracting information from free text in English, and potentially other languages as well, for entry into a database, and potentially for other applications. It works essentially as a cascaded, nondeterministic finite state automaton.
Proceedings of the workshop on Speech and Natural Language - HLT '89, 1989
TACITUS is a general and domain-independent natural language processing system, used so far prima... more TACITUS is a general and domain-independent natural language processing system, used so far primarily for message processing. It performs a syntactic analysis of the sentences in the text, producing a logical form. Next, inferential pragmatics processing is applied to the logical form to solve problems of schema recognition, reference resolution, metonymy resolution, and the interpretation of vague predicates. An analysis component then produces the desired output for the application. TACITUS has been applied to several quite different domains, including naval equipment failure reports, naval operations reports, and terrorist reports.
SRI is developing a spoken language system (SLS) that should permit natural and efficient communi... more SRI is developing a spoken language system (SLS) that should permit natural and efficient communication with an air travel information system. SLS development at SRI divides roughly into three areas: speech recognition, natural language processing, and human interface design.The ...
Proceedings of the 31st annual meeting on Association for Computational Linguistics -, 1993
y 1. ABSTRACT Gemini is a natural language understanding system developed for spoken language app... more y 1. ABSTRACT Gemini is a natural language understanding system developed for spoken language applications. The paper describes the architecture of Gemini, paying particular attention to resolving the tension between robustness and overgeneration. Gemini features a broad-coverage uni cation-based grammar of English, fully interleaved syntactic and semantic processing in an all-paths, bottom-up parser, and an utterancelevel parser to nd interpretations of sentences that might not be analyzable as complete sentences. Gemini also includes novel components for recognizing and correcting grammatical dis uencies, and for doing parse preferences. This paper presents a component-by-component view of Gemini, providing detailed relevant measurements of size, e ciency, and performance.
ABSTRACT We describe the modification of a grammar to take advantage of prosodic information auto... more ABSTRACT We describe the modification of a grammar to take advantage of prosodic information automatically extracted from speech. The work includes (1) the development of an integer "break index" representation of prosodic phrase boundary information, (2) the automatic detection of prosodic phrase breaks using a hidden Markov model on relative duration of phonetic segments, and (3) the integration of the prosodic phrase break information in SRI's Spoken Language System to rule out alternative parses in otherwise syntactically ambiguous sentences. Initial experiments using ambiguous sentences read by radio announcers achieved good results in both detection and parsing. Automatically detected phrase break indices had a correlation greater than 0.86 with hand-labeled data for speaker-dependent models; and, in a subset of sentences with preposition ambiguities, the number of parses was reduced by 25% with a simple grammar modification.
We describe an approach to applying a particular kind of Natural Language Processing (NLP) system... more We describe an approach to applying a particular kind of Natural Language Processing (NLP) system to the TREC routing task in Information Retrieval (IR). Rather than attempting to use NLP techniques in indexing documents in a corpus, we adapted an information extraction (IE) system to act as a post-lter on the output of an IR system. The IE system was con gured to score each of the top 2000 documents as determined by an IR system and on the basis of that score to rerank those 2000 documents. One aim was to improve precision on routing tasks. Another was to make it easier to write IE grammars for multiple topics.
We describe an approach to applying a particular kind of Natural Language Processing (NLP) system... more We describe an approach to applying a particular kind of Natural Language Processing (NLP) system to the TREC routing task in Information Retrieval (IR). Rather than attempting to use NLP techniques in indexing documents in a corpus, we adapted an information extraction (IE) system to act as a post-lter on the output of an IR system. The IE system was con gured to score each of the top 2000 documents as determined by an IR system and on the basis of that score to rerank those 2000 documents. One aim was to improve precision on routing tasks. Another was to make it easier to write IE grammars for multiple topics.
We describe the modification of a grammar to take advantage of prosodic information provided by a... more We describe the modification of a grammar to take advantage of prosodic information provided by a speech recognition system. This initial study is limited to the use of relative duration of phonetic segments in the assignment of syntactic structure, specifically in ruling out alternative parses in otherwise ambiguous sentences. Taking advantage of prosodic information in parsing can make a spoken language system more accurate and more efficient, if prosodicsyntactic mismatches, or unlikely matches, can be pruned. We know of no other work that has succeeded in automatically extracting speech information and using it in a parser to rule out extraneous parses.
FASTUS is a (slightly permuted) acronym for Finite State Automaton Text Understanding System. It ... more FASTUS is a (slightly permuted) acronym for Finite State Automaton Text Understanding System. It is a system for extracting information from free text in English, and potentially other languages as well, for entry into a database, and potentially for other applications. It works essentially as a cascaded, nondeterministic finite state automaton.
... system is the best approach to the text information extraction problem, and that the technolo... more ... system is the best approach to the text information extraction problem, and that the technology is now rip e for application to real-world problems . Our experience has shown that ... [1] Appelt, Douglas, Jerry Hobbs, John Bear, David Israel, and Mabry Tyson . FASTUS: a finite-state ...
This paper describes a morphological analyzer which, when parsing a word, uses two sets of rules:... more This paper describes a morphological analyzer which, when parsing a word, uses two sets of rules: rnles describing the syntax of words, and rules describing facts about orthography.
Uploads
Papers by John Bear