| 1 |
;;; |
| 2 |
;;; text.segmented-match - Prefix match with segmented words |
| 3 |
;;; |
| 4 |
;;; Copyright (c) 2022-2024 Shiro Kawai <[email protected]> |
| 5 |
;;; |
| 6 |
;;; Redistribution and use in source and binary forms, with or without |
| 7 |
;;; modification, are permitted provided that the following conditions |
| 8 |
;;; are met: |
| 9 |
;;; |
| 10 |
;;; 1. Redistributions of source code must retain the above copyright |
| 11 |
;;; notice, this list of conditions and the following disclaimer. |
| 12 |
;;; |
| 13 |
;;; 2. Redistributions in binary form must reproduce the above copyright |
| 14 |
;;; notice, this list of conditions and the following disclaimer in the |
| 15 |
;;; documentation and/or other materials provided with the distribution. |
| 16 |
;;; |
| 17 |
;;; 3. Neither the name of the authors nor the names of its contributors |
| 18 |
;;; may be used to endorse or promote products derived from this |
| 19 |
;;; software without specific prior written permission. |
| 20 |
;;; |
| 21 |
;;; THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 22 |
;;; "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 23 |
;;; LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 24 |
;;; A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 25 |
;;; OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 26 |
;;; SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED |
| 27 |
;;; TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR |
| 28 |
;;; PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF |
| 29 |
;;; LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING |
| 30 |
;;; NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
| 31 |
;;; SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 32 |
;;; |
| 33 |
|
| 34 |
;; match c-w-i-f with call-with-input-file etc. |
| 35 |
|
| 36 |
(define-module text.segmented-match |
| 37 |
(use srfi.13) |
| 38 |
(export make-segmented-prefix-matcher |
| 39 |
segmented-prefix?)) |
| 40 |
(select-module text.segmented-match) |
| 41 |
|
| 42 |
;; This can be accelearated if we preprocess the corpus into a trie, |
| 43 |
;; but let's start a simple case. |
| 44 |
|
| 45 |
;; API |
| 46 |
(define (segmented-prefix? pattern word :optional (separator #\-)) |
| 47 |
(assume-type pattern <string>) |
| 48 |
(assume-type word <string>) |
| 49 |
(boolean ((make-segmented-prefix-matcher pattern separator) word))) |
| 50 |
|
| 51 |
;; API |
| 52 |
;; Returns a procedure that takes a string and... |
| 53 |
;; - Returns #f if pattern doesn't consist a segmented prefix |
| 54 |
;; - Returns #t if every segments of pattern is corresponding segments |
| 55 |
;; of input, and no more segments left in the input |
| 56 |
;; - Returns a string, which is a remaining segments of the input. |
| 57 |
(define (make-segmented-prefix-matcher pattern separator) |
| 58 |
(define (rec segs rest) |
| 59 |
(cond [(null? segs) rest] |
| 60 |
[(string-prefix? (car segs) rest) ;(car segs) never contain separator |
| 61 |
(if-let1 rest (string-scan rest separator 'after) |
| 62 |
(rec (cdr segs) rest) |
| 63 |
(null? (cdr segs)))] |
| 64 |
[else #f])) |
| 65 |
(define segments (string-split pattern separator)) |
| 66 |
(^[word] (rec segments word))) |