class_docstr: longest common subsequence similarity
  
  https://en.wikipedia.org/wiki/Longest_common_subsequence_problem
class_docstr_tok: ["longest","common","subsequence","similarity","https",":","\/\/en.wikipedia.org\/wiki\/Longest_common_subsequence_problem"]
code: def __init__(
      self,
      qval: int = 1,
      test_func: TestFunc = None,
      external: bool = True,
  ) -> None:
      self.qval = qval
      self.test_func = test_func or self._ident
      self.external = external
  
imports: from __future__ import annotations
  from difflib import SequenceMatcher
  from typing import Any
  from ..utils import find_ngrams
  from .base import BaseSimilarity
  from .types import TestFunc
label_desc: Use image node_id 1 to create a new LCSSeq object from inherited base classes: _BaseSimilarity with example: obj = LCSSeq(qval, test_func, external)