Efficient Algorithms for the Spoonerism Problem

DOI10.1007/978-3-540-72914-3_9MaRDI QIDQ5426017zbMATH OpenOpenAlexFDO

Authors Juraj Hromkovič, Richard Královič, Tobias Mömke, K. Steinhöfel, Hans-Joachim Böckenhauer

Publication date 15 November 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-51156

Mathematics Subject Classification ID

Natural language processing (68T50)

Recommendations

• Efficient algorithms for approximate string matching with swaps
• Efficient special cases of pattern matching with swaps
• Pattern Matching with Swaps
• Approximate swapped matching.
• A new algorithm for efficient pattern matching with swaps

This page was built for publication: Efficient Algorithms for the Spoonerism Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5426017)