Discovering characteristic expressions in literary works.

DOI10.1016/S0304-3975(02)00185-8zbMath1051.68130OpenAlexW2159903106MaRDI QIDQ1870549

Tomoko Fukuda, Masayuki Takeda, Ichiro Nanri, Tetsuya Matsumoto

Publication date: 14 May 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00185-8

zbMATH Keywords

Characteristic expressionsLiterary worksOptimal pattern discoverySubstring statisticsWaka poetry

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Natural language processing (68T50)

Related Items (4)

FINDING CHARACTERISTIC SUBSTRINGS FROM COMPRESSED TEXTS ⋮ Efficient computation of substring equivalence classes with suffix arrays ⋮ On-line construction of compact directed acyclic word graphs ⋮ Special factors and the combinatorics of suffix and factor automata

Cites Work

• Discovering instances of poetic allusion from anthologies of classical Japanese poems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Discovering characteristic expressions in literary works.