Bootstrapping Syntax and Recursion using Alignment-Based Learning

Details Bootstrapping Syntax and Recursion using Alignment-Based Learning Bootstrapping Syntax and Recursion using Alignment-Based Learning

2001-04-03

arxiv.org/abs/cs/0104007v1

Proceedings of the Seventeenth International Conference on Machine Learning. pages 1063-1070

Computer Science

Learning

8 pages

Scientific paper

This paper introduces a new type of unsupervised learning algorithm, based on the alignment of sentences and Harris's (1951) notion of interchangeability. The algorithm is applied to an untagged, unstructured corpus of natural language sentences, resulting in a labelled, bracketed version of the corpus. Firstly, the algorithm aligns all sentences in the corpus in pairs, resulting in a partition of the sentences consisting of parts of the sentences that are similar in both sentences and parts that are dissimilar. This information is used to find (possibly overlapping) constituents. Next, the algorithm selects (non-overlapping) constituents. Several instances of the algorithm are applied to the ATIS corpus (Marcus et al., 1993) and the OVIS (Openbaar Vervoer Informatie Systeem (OVIS) stands for Public Transport Information System.) corpus (Bonnema et al., 1997). Apart from the promising numerical results, the most striking result is that even the simplest algorithm based on alignment learns recursion.

Affiliated with

Also associated with

No associations

Rating

Bootstrapping Syntax and Recursion using Alignment-Based Learning does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bootstrapping Syntax and Recursion using Alignment-Based Learning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bootstrapping Syntax and Recursion using Alignment-Based Learning will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-173342