Results 1 - 10 of 336

Partial parsing via finite-state cascades

by Steven Abney - Natural Language Engineering , 1996
"... Finite-state cascades represent an attractive architecture for parsing unrestricted text. Deterministic parsers specified by finite-state cascades are fast and reliable. They can be extended at modest cost to construct parse trees with finite feature structures. Finally, such deterministic parsers d ..."
Abstract - Cited by 340 (4 self) - Add to MetaCart
Finite-state cascades represent an attractive architecture for parsing unrestricted text. Deterministic parsers specified by finite-state cascades are fast and reliable. They can be extended at modest cost to construct parse trees with finite feature structures. Finally, such deterministic parsers

Using Lexical Chains for Text Summarization

by Resina Barzilay, Michael Elbadad , 1997
"... We investigate one technique to produce a summary of an original text without requiring its full semantic interpretation, but instead relying on a model of the topic progression in the text derived from lexical chains. We present a new algorithm to compute lexical chains in a text, merging several r ..."
Abstract - Cited by 451 (9 self) - Add to MetaCart
robust knowledge sources: the WordNet thesaurus, a part-of-speech tagger and shallow parser for the ldentification of nominal groups, and a segmentation algorithm derived from (Hearst, 1994) Summarization proceeds in three steps: the original text m first segmented, lexical chains are constructed, strong

IceParser: An Incremental Finite-State Parser for Icelandic

by Hrafn Loftsson - In Proceedings of NoDaLiDa 2007 , 2007
"... We describe and evaluate an incremental finite-state parser for Icelandic – the first parser published for the language. Input to the parser is POS tagged text and it generates output according to a shallow syntactic annotation scheme, specifically designed for this project. The parser consists of a ..."
Abstract - Cited by 8 (5 self) - Add to MetaCart
We describe and evaluate an incremental finite-state parser for Icelandic – the first parser published for the language. Input to the parser is POS tagged text and it generates output according to a shallow syntactic annotation scheme, specifically designed for this project. The parser consists

Comparing and combining finite-state and context-free parsers

by Kristy Hollingshead, Seeger Fisher, Brian Roark - In Proceedings of HLT-EMNLP , 2005
"... In this paper, we look at comparing highaccuracy context-free parsers with highaccuracy finite-state (shallow) parsers on several shallow parsing tasks. We show that previously reported comparisons greatly under-estimated the performance of context-free parsers for these tasks. We also demonstrate t ..."
Abstract - Cited by 14 (5 self) - Add to MetaCart
In this paper, we look at comparing highaccuracy context-free parsers with highaccuracy finite-state (shallow) parsers on several shallow parsing tasks. We show that previously reported comparisons greatly under-estimated the performance of context-free parsers for these tasks. We also demonstrate

Using the Incremental Finite-State Architecture to create a Spanish Shallow Parser

by Uria Gala Pavia
"... This paper describes a Spanish Shallow Parser built using the Incremental Finite-State Parsing Architecture (IFSP). This approach for Shallow Parsing permits a constructivist syntactic analysis: each transducer uses as input 1 the result of the analysis given by the previous transducer for obtaining ..."
Abstract - Add to MetaCart
This paper describes a Spanish Shallow Parser built using the Incremental Finite-State Parsing Architecture (IFSP). This approach for Shallow Parsing permits a constructivist syntactic analysis: each transducer uses as input 1 the result of the analysis given by the previous transducer

Incremental Finite-State Parsing

by Salah Ait-mokhtar, Jean-pierre Chanod - In Proceedings of the Fifth Conference on Applied Natural Language Processing , 1997
"... This paper describes a new finite-state shallow parser. It merges constructive and reductionist approaches within a highly modular architecture. Syntactic information is added at the sentence level in an incremental way, depending on the contextual information available at a given stage. This approa ..."
Abstract - Cited by 57 (2 self) - Add to MetaCart
This paper describes a new finite-state shallow parser. It merges constructive and reductionist approaches within a highly modular architecture. Syntactic information is added at the sentence level in an incremental way, depending on the contextual information available at a given stage

Pipeline Iteration

by Kristy Hollingshead, Brian Roark
"... This paper presents pipeline iteration, an approach that uses output from later stages of a pipeline to constrain earlier stages of the same pipeline. We demonstrate significant improvements in a state-of-the-art PCFG parsing pipeline using base-phrase constraints, derived either from later stages o ..."
Abstract - Cited by 13 (2 self) - Add to MetaCart
of the parsing pipeline or from a finitestate shallow parser. The best performance is achieved by reranking the union of unconstrained parses and relatively heavilyconstrained parses. 1

Incremental Finite-State Parsing

by Salah It-Mokhtar Jean-Pierre , 1997
"... This paper describes a new finite-state shallow parser. It merges constructive and reductionist approaches within a highly modular architecture. Syntactic informa- tion is added at the sentence level in an incremental way, depending on the contextual information available at a given stage. ..."
Abstract - Add to MetaCart
This paper describes a new finite-state shallow parser. It merges constructive and reductionist approaches within a highly modular architecture. Syntactic informa- tion is added at the sentence level in an incremental way, depending on the contextual information available at a given stage.

Schematic finite-state intersection parsing

by Anssi Yli-jyrä - Short Papers Presented at the 10th Nordic Conference of Computational Linguistics (NODALIDA-95 , 1995
"... The framework of Finite-State Intersection Grammars employs a parsing technique according to which several finite-state automata are intersected to determine the output automaton. Implementation of the intersection parser has turned out to be a difficult task. Several problems in efficiency arise wh ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
The framework of Finite-State Intersection Grammars employs a parsing technique according to which several finite-state automata are intersected to determine the output automaton. Implementation of the intersection parser has turned out to be a difficult task. Several problems in efficiency arise

A Cascaded Finite-State Parser for German

by Michael Schiehlen , 2003
"... Evaluation Method The paper presents two approaches to partial parsing of German: a tagger trained on dependency tuples, and a cascaded finite-state parser (Abney, 1997). ..."
Abstract - Cited by 13 (1 self) - Add to MetaCart
Evaluation Method The paper presents two approaches to partial parsing of German: a tagger trained on dependency tuples, and a cascaded finite-state parser (Abney, 1997).
Results 1 - 10 of 336