The Multistore Parser for Hierarchical Syntactic Structures.
Saved in:
| Title: | The Multistore Parser for Hierarchical Syntactic Structures. |
|---|---|
| Authors: | Glasersfeld, Ernst von1, Pisani, Pier Paolo1 |
| Source: | Communications of the ACM. Feb1970, Vol. 13 Issue 2, p74-82. 9p. 5 Diagrams. |
| Subjects: | Linguistic String Parser (Computer grammar), Information retrieval, Statistical matching, Frames (Linguistics), Electronic file management, Data structures, Computational linguistics |
| Abstract: | A syntactic parser is described for hierarchical concatenation patterns that are presented to the analyzer in the form of linear strings. Particular emphasis is given to the system of "significant addresses" by means of which processing times for large-wale matching procedures can be substantially reduced. The description makes frequent use of examples taken from the fully operational implementation of the parser in an experimental English sentence analyzer. By structuring an area of the computer's central core storage in such a way that the individual locations of bytes and bits come to represent the data involved in the matching procedure, the shifting of information is reduced to a minimum, and the searching of lists is eliminated altogether. The matches are traced by means of binary masks and the state of single bits determines the operational flow of the procedure. The method could be implemented with any interpretive grammar, provided it can be expressed by the functional classification of the items composing the input hierarchical structures. [ABSTRACT FROM AUTHOR] |
| Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 5221501 AccessLevel: 6 PubType: Periodical PubTypeId: serialPeriodical PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: The Multistore Parser for Hierarchical Syntactic Structures. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Glasersfeld%2C+Ernst+von%22">Glasersfeld, Ernst von</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Pisani%2C+Pier+Paolo%22">Pisani, Pier Paolo</searchLink><relatesTo>1</relatesTo> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Communications+of+the+ACM%22">Communications of the ACM</searchLink>. Feb1970, Vol. 13 Issue 2, p74-82. 9p. 5 Diagrams. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Linguistic+String+Parser+%28Computer+grammar%29%22">Linguistic String Parser (Computer grammar)</searchLink><br /><searchLink fieldCode="DE" term="%22Information+retrieval%22">Information retrieval</searchLink><br /><searchLink fieldCode="DE" term="%22Statistical+matching%22">Statistical matching</searchLink><br /><searchLink fieldCode="DE" term="%22Frames+%28Linguistics%29%22">Frames (Linguistics)</searchLink><br /><searchLink fieldCode="DE" term="%22Electronic+file+management%22">Electronic file management</searchLink><br /><searchLink fieldCode="DE" term="%22Data+structures%22">Data structures</searchLink><br /><searchLink fieldCode="DE" term="%22Computational+linguistics%22">Computational linguistics</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: A syntactic parser is described for hierarchical concatenation patterns that are presented to the analyzer in the form of linear strings. Particular emphasis is given to the system of "significant addresses" by means of which processing times for large-wale matching procedures can be substantially reduced. The description makes frequent use of examples taken from the fully operational implementation of the parser in an experimental English sentence analyzer. By structuring an area of the computer's central core storage in such a way that the individual locations of bytes and bits come to represent the data involved in the matching procedure, the shifting of information is reduced to a minimum, and the searching of lists is eliminated altogether. The matches are traced by means of binary masks and the state of single bits determines the operational flow of the procedure. The method could be implemented with any interpretive grammar, provided it can be expressed by the functional classification of the items composing the input hierarchical structures. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=5221501 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1145/362007.362026 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 9 StartPage: 74 Subjects: – SubjectFull: Linguistic String Parser (Computer grammar) Type: general – SubjectFull: Information retrieval Type: general – SubjectFull: Statistical matching Type: general – SubjectFull: Frames (Linguistics) Type: general – SubjectFull: Electronic file management Type: general – SubjectFull: Data structures Type: general – SubjectFull: Computational linguistics Type: general Titles: – TitleFull: The Multistore Parser for Hierarchical Syntactic Structures. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Glasersfeld, Ernst von – PersonEntity: Name: NameFull: Pisani, Pier Paolo IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 02 Text: Feb1970 Type: published Y: 1970 Identifiers: – Type: issn-print Value: 00010782 Numbering: – Type: volume Value: 13 – Type: issue Value: 2 Titles: – TitleFull: Communications of the ACM Type: main |
| ResultId | 1 |
