JSPM

  • Created
  • Published
  • Downloads 797192
  • Score
    100M100P100Q187885F
  • License MIT

Latin-script (natural language) parser

Package Exports

  • parse-latin
  • parse-latin/lib/plugin/break-implicit-sentences
  • parse-latin/lib/plugin/make-final-white-space-siblings
  • parse-latin/lib/plugin/make-initial-white-space-siblings
  • parse-latin/lib/plugin/merge-affix-exceptions
  • parse-latin/lib/plugin/merge-affix-symbol
  • parse-latin/lib/plugin/merge-initial-lower-case-letter-sentences
  • parse-latin/lib/plugin/merge-non-word-sentences
  • parse-latin/lib/plugin/merge-remaining-full-stops
  • parse-latin/lib/plugin/patch-position
  • parse-latin/lib/plugin/remove-empty-nodes

This package does not declare an exports field, so the exports above have been automatically detected and optimized by JSPM instead. If any package subpath is missing, it is recommended to post an issue to the original package (parse-latin) to support the "exports" field. If that is not possible, create a JSPM override to customize the exports field for this package.

Readme

parse-latin Build Status Coverage Status

A Latin script language parser for retext producing NLCST nodes.

Whether Old-English (“þā gewearþ þǣm hlāforde and þǣm hȳrigmannum wiþ ānum penninge”), Icelandic (“Hvað er að frétta”), French (“Où sont les toilettes?”), parse-latin does a good job at tokenizing it.

Note also that parse-latin does a decent job at tokenizing Latin-like scripts, Cyrillic (“Добро пожаловать!”), Georgian (“როგორა ხარ?”), Armenian (“Շատ հաճելի է”), and such.

Installation

npm:

npm install parse-latin

parse-latin is also available for duo, and as an AMD, CommonJS, and globals module, uncompressed and compressed.

Usage

Dependencies:

var inspect = require('unist-util-inspect');
var ParseLatin = require('parse-latin');
var latin = new ParseLatin();

Invoking parse:

var ast = latin.parse('A simple sentence.');

Yields:

RootNode[1] (1:1-1:19, 0-18)
└─ ParagraphNode[1] (1:1-1:19, 0-18)
   └─ SentenceNode[6] (1:1-1:19, 0-18)
      ├─ WordNode[1] (1:1-1:2, 0-1)
      │  └─ TextNode: "A" (1:1-1:2, 0-1)
      ├─ WhiteSpaceNode: " " (1:2-1:3, 1-2)
      ├─ WordNode[1] (1:3-1:9, 2-8)
      │  └─ TextNode: "simple" (1:3-1:9, 2-8)
      ├─ WhiteSpaceNode: " " (1:9-1:10, 8-9)
      ├─ WordNode[1] (1:10-1:18, 9-17)
      │  └─ TextNode: "sentence" (1:10-1:18, 9-17)
      └─ PunctuationNode: "." (1:18-1:19, 17-18)

API

ParseLatin([options])

Exposes the functionality needed to tokenize natural Latin-script languages into a syntax tree.

Parameters:

  • options (Object, optional)

    • position (boolean, default: true) - Whether to add positional information to nodes.

ParseLatin#tokenize(value)

Tokenize natural Latin-script language into letter and numbers (words), white space, and everything else (punctuation).

Parameters:

  • value (string) — Value to parse.

Returns: Array.<NLCSTNode> — Nodes.

ParseLatin#parse(value)

Tokenize natural Latin-script languages into an NLCST syntax tree.

Parameters:

  • value (string) — Value to parse.

Returns: NLCSTNode — Root node.

Syntax Tree Format

Note: The easiest way to see how parse-latin tokenizes and parses, is by using the online parser demo, which shows the syntax tree corresponding to the typed text.

Basically, parse-latin splits text into white space, word, and punctuation tokens. parse-latin starts out with a pretty easy definition, one that most other tokenizers use:

  • A “word” is one or more letter or number characters;
  • A “white space” is one or more white space characters;
  • A “punctuation” is one or more of anything else;

Then, it manipulates and merges those tokens into an NLCST syntax tree, adding sentences and paragraphs where needed.

  • Some punctuation marks are part of the word they occur in, e.g., non-profit, she’s, G.I., 11:00, N/A, &c, nineteenth- and...;

  • Some full-stops do not mark a sentence end, e.g., 1., e.g., id.;

  • Although full-stops, question marks, and exclamation marks (sometimes) end a sentence, that end might not occur directly after the mark, e.g., .), .";

  • And many more exceptions.

License

MIT © Titus Wormer