Using Syntax to Improve Word Alignment Precision for Syntax-Based Machine Translation (2009)
Victoria Fossum, Kevin Knight, Steven Abney
Word alignments that violate syntactic correspondences interfere with the extraction of string-to-tree transducer rules for syntaxbased machine translation. We present an algorithm for identifying...
The usual approach to stochastic parsing is to ‘reverse ’ a model of stochastic generation. For example, a stochastic context-free grammar (SCFG) G defines a stochastic process for generating...
Steven Abney, Long Sentences, Chen Chen
• Standard parsers – Evaluate global parses, not partial parses – Do all-paths search (chart or no) • Why unrestricted text is difficult
Steven Abney, Michael Collins, Amit Singhal, Answer Extraction In, Sasha Blair-goldensohn, Kathleen R. Mckeown, ...
gov/projects/duc/roadmapping.html.
Steven Abney, Long Sentences, Chen Chen
parses-- Do all-paths search (chart or no) ffl Why unrestricted text is difficult
The usual approach to stochastic parsing is to `reverse ' a model of stochastic generation. For example, a stochastic context-free grammar (SCFG) G defines a stochastic process for generating...
1 IMPROVING INTONATIONAL PHRASING WITH SYNTACTIC INFORMATION (2007)
Steven Abney, Julia Hirschberg, Michael Collins
The prediction of intonational phrase boundaries from raw text is an important step for a text-to-speech system: Locating where to place short pauses enables more natural sounding speech, that can be...
Understanding the Yarowsky algorithm (2004)
Many problems in computational linguistics are well suited for bootstrapping (semi-supervised learning) techniques. The Yarowsky algorithm is a well-known bootstrapping algorithm, but it is not...
This paper refines the analysis of cotraining, defines and evaluates a new co-training algorithm that has theoretical justification, gives a theoretical justification for the Yarowsky algorithm, and...
Att Laboratories Research, Steven Abney
This paper refines the analysis of cotraining, defines and evaluates a new co-training algorithm that has theoretical justification, gives a theoretical justification for the Yarowsky algorithm, and...
Steven Abney, Michael Collins, Amit Singhal
Information retrieval systems have typically concentrated on retrieving a set of documents which are relevant to a user’s query. This paper describes a system that attempts to retrieve a much...
Steven Abney, Michael Collins, Amit Singhal
Information retrieval systems have typically concen-trated on retrieving a set of documents which are rel-evant to a user's query. This paper describes a sys-tem that attempts to retrieve a much...
Steven Abney, Michael Collins, Amit Singhal
Information retrieval systems have typically concentrated on retrieving a set of documents which are relevant to a user's query. This paper describes a system that attempts to retrieve a much...
“Statistical methods ” refers here specifically to statistical methods in computational linguistics. This represents a new body of practice in computational linguistics that has become standard...
Relating probabilistic grammars and automata (1999)
Steven Abney, David Mcallester, Fernando Pereira
Both probabilistic context-free grammars (PCFGs) and shift-reduce probabilistic push-down automata (PPDAs) have been used for language modeling and maximum likelihood parsing. We investigate the...
Hiding a semantic hierarchy in a Markov model (1999)
We introduce a new model of selectional preference induction. Unlike previous ap-proaches, we provide a stochastic genera-tion model for the words that appear as arguments of a predicate. More...
Boosting applied to tagging and PP attachment (1999)
schapire, Boosting is a machine learning algorithm that is not well known in computational linguistics. We ap-ply it to part-of-speech tagging and prepositional phrase attachment. Performance is very...
Hiding a semantic class hierarchy in a Markov model (1999)
This paper introduces a new model of selectional preference induction. Unlike previous approaches we provide a stochastic generation model for the words that appear as arguments of a predicate. More...
Hiding a semantic hierarchy in a Markov model (1999)
We introduce a new model of selectional preference induction. Unlike previous approaches, we provide a stochastic generation model for the words that appear as arguments of a predicate. More...
Boosting Applied to Tagging and PP Attachment (1999)
Steven Abney, Robert E. Schapire, Yoram Singer
Boosting is a machine learning algorithm that is not well known in computational linguistics. We apply it to part-of-speech tagging and prepositional phrase attachment. Performance is very...
Relating Probabilistic Grammars and Automata (1999)
Steven Abney, David Mcallester, Fernando Pereira
Both probabilistic context-free grammars (PCFGs) and shift-reduce probabilistic pushdown automata (PPDAs) have been used for language modeling and maximum likelihood parsing. We investigate the...
Boosting Applied to Tagging and PP Attachment (1999)
Steven Abney, Robert E. Schapire, Yoram Singer
Boosting is a machine learning algorithm that is not well known in computational linguistics. We apply it to part-of-speech tagging and prepositional phrase attachment. Performance is very...
Boosting applied to tagging and PP attachment (1999)
Steven Abney, Robert E. Schapire, Yoram Singer
Boosting is a machine learning algorithm that is not well known in computational linguistics. We apply it to part-of-speech tagging and prepositional phrase attachment. Performance is very...
Relating probabilistic grammars and automata (1999)
Steven Abney, David Mcallester, Fernando Pereira
Both probabilistic context-free grammars (PCFGs) and shift-reduce probabilistic pushdown automata (PPDAs) have been used for language modeling and maximum likelihood parsing. We investigate the...
Part-of-speech tagging and partial parsing (1997)
The initial impetus for the current popularity of statistical methods in computational linguistics was provided in large part by the papers on part-of-speech tagging by Church [20], DeRose [25], and...
Part-of-speech tagging and partial parsing (1997)
The initial impetus for the current popularity of statistical methods in computational linguistics was provided in large part by the papers on part-of-speech tagging by Church [20], DeRose [25], and...
The SCOL Manual - Version 0.1b (1997)
this document, I write ScolHome as a stand-in for the pathname of the SCOL home directory.
Stochastic Attribute-Value Grammars (1997)
Probabilistic analogues of regular and context-free grammars are wellknown in computational linguistics, and currently the subject of intensive research. To date, however, no satisfactory...
Stochastic Attribute-Value Grammars (1996)
Probabilistic analogues of regular and context-free grammars are well-known in computational linguistics, and currently the subject of intensive research. To date, however, no satisfactory...
Statistical methods and linguistics (1996)
In the space of the last ten years, statistical methods have gone from being virtually unknown in computational linguistics to being a fundamental given. In 1996, no one can profess to be a...
Statistical methods and linguistics (1996)
In the space of the last ten years, statistical methods have gone from being virtually unknown in computational linguistics to being a fundamental given. In 1996, no one can profess to be a...
Partial parsing via finite-state cascades (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...
Partial Parsing via Finite-State Cascades (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...
Statistical Methods and Linguistics (1996)
is unusual as a mass noun, but can in fact be used as one, as for example in the article consisted of three pages of abstract and only two pages of actual text. One might object that the NP headed by...
Partial parsing via finite-state cascades (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...
Statistical methods and linguistics (1996)
In the space of the last ten years, statistical methods have gone from being virtually unknown in computational linguistics to being a fundamental given. In 1996, no one can profess to be a...
Partial parsing via finite-state cascades (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...
Chunks and dependencies: bringing processing evidence to bear on syntax (1995)
At least some psycholinguists exploring how sentences are structured in linguistic behavior have concluded that the "performance structures " that emerge from experimental data...
Chunks and dependencies: bringing processing evidence to bear on syntax (1995)
At least some psycholinguists exploring how sentences are structured in
Chunks and Dependencies: Bringing Processing Evidence to Bear on Syntax (1995)
this paper, I would like to consider how we might modify standard approaches to phrase structure in order to account for the behavioral and prosodic evidence alluded to above. Fortunately, I believe...
Dependency Grammars and Context-Free Grammars (1994)
The question arises from time to time what the relation is between dependency grammars (DG’s) and phrase-structure grammars. A classic paper by Gaifman [1] would appear to have laid the issue to...
Measures and Models for Phrase Recognition (1993)
I present an entropy measure for evaluating parser performance. The measure is fine-grained, and permits us to evaluate performance at the level of individual phrases. The parsing problem is...
Prosodic Structure, Performance Structure And Phrase Structure (1992)
It is natural to expect phrase structure to be important in predicting prosodic phrasing. Yet there appears to be a concensus that syntactic phrases do not correspond well to prosodic phrasing, and...
I begin with an intuition: when I read a sentence, I read it a chunk at a time. For example, the previous sentence breaks up something like this:
Introduction I begin with an intuition: when I read a sentence, I read it a chunk at a time. For example, the previous sentence breaks up something like this: (1) [I begin] [with an intuition]: [when...
Syntactic Affixation and Performance Structures (1990)
Introduction Functional elements (determiners, complementizers, modals, degree words) are in many ways the syntactic analogues of affixes in morphology. Typically, functional elements are bound...
Rapid Incremental Parsing with Repair (1990)
This work describes a method of achieving rapid, reliable parsing of natural text through the application of three techniques: (1) resolving small questions sequentially, (2) repairing errors...