diff --git a/src/Plugin/search_api/backend/SearchApiSolrBackend.php b/src/Plugin/search_api/backend/SearchApiSolrBackend.php
index f8a4f99..27be2a3 100644
--- a/src/Plugin/search_api/backend/SearchApiSolrBackend.php
+++ b/src/Plugin/search_api/backend/SearchApiSolrBackend.php
@@ -2742,6 +2742,7 @@ class SearchApiSolrBackend extends BackendPluginBase implements SolrBackendInter
               // @see https://www.drupal.org/project/search_api/issues/2991134
               case 'terms':
               case 'phrase':
+              case 'sloppy_phrase':
               case 'edismax':
                 if (is_array($value)) {
                   $keys += $value;
diff --git a/src/Plugin/search_api/parse_mode/SloppyPhrase.php b/src/Plugin/search_api/parse_mode/SloppyPhrase.php
new file mode 100644
index 0000000..c2df186
--- /dev/null
+++ b/src/Plugin/search_api/parse_mode/SloppyPhrase.php
@@ -0,0 +1,18 @@
+<?php
+
+namespace Drupal\search_api_solr\Plugin\search_api\parse_mode;
+
+use Drupal\search_api\Plugin\search_api\parse_mode\Terms;
+
+/**
+ * Represents a parse mode that parses the sentence into a sloppy search for the sentence.
+ *
+ * @SearchApiParseMode(
+ *   id = "sloppy_phrase",
+ *   label = @Translation("Phrase search with sloppiness."),
+ *   description = @Translation("The query is interpreted as a single phrase. Solr will also show results where the words are not directly positioned next to each other. The scoring will be lower the further away the words are from eachother"),
+ * )
+ */
+class SloppyPhrase extends Terms {
+
+}
diff --git a/src/Utility/Utility.php b/src/Utility/Utility.php
index 27b7dd3..3a6385a 100644
--- a/src/Utility/Utility.php
+++ b/src/Utility/Utility.php
@@ -602,6 +602,9 @@ class Utility {
    * ensure that stop words in boolean combinations don't lead to zero results.
    * Therefore this function will produce these queries:
    *
+   * Careful interpreting this, phrase  and sloppy phrase queries will represent
+   * different phrases as A & B. To be very clear, A could equal multiple words.
+   *
    * @code
    * #conjunction | #negation | fields | parse mode     | return value
    * ---------------------------------------------------------------------------
@@ -621,6 +624,10 @@ class Utility {
    * OR           | FALSE     | [x,y]  | phrase         | +(x:(A B)^1 y:(A B)^1)
    * OR           | TRUE      | [x,y]  | terms          | -(((x:A^1 y:A^1) (x:B^1 y:B^1)) x:(A B)^1 y:(A B)^1)
    * OR           | TRUE      | [x,y]  | phrase         | -(x:(A B)^1 y:(A B)^1)
+   * AND          | FALSE     | [x,y]  | sloppy_phrase  | +(x:(+"A"~10000000 +"B"~10000000)^1 y:(+"A"~10000000 +"B"~10000000)^1)
+   * AND          | TRUE      | [x,y]  | sloppy_phrase  | -(x:(+"A"~10000000 +"B"~10000000)^1 y:(+"A"~10000000 +"B"~10000000)^1)
+   * OR           | FALSE     | [x,y]  | sloppy_phrase  | +(x:("A"~10000000 "B"~10000000)^1 y:("A"~10000000 "B"~10000000)^1)
+   * OR           | TRUE      | [x,y]  | sloppy_phrase  | -(x:("A"~10000000 "B"~10000000)^1 y:("A"~10000000 "B"~10000000)^1)
    * AND          | FALSE     | [x,y]  | edismax        | +({!edismax qf=x^1,y^1}+A +B)
    * AND          | TRUE      | [x,y]  | edismax        | -({!edismax qf=x^1,y^1}+A +B)
    * OR           | FALSE     | [x,y]  | edismax        | +({!edismax qf=x^1,y^1}A B)
@@ -668,6 +675,7 @@ class Utility {
     $pre = '+';
     $neg = '';
     $query_parts = [];
+    $sloppiness = '';
 
     if (is_array($keys)) {
       $queryHelper = \Drupal::service('solarium.query_helper');
@@ -701,7 +709,7 @@ class Utility {
         }
         else {
           switch ($parse_mode_id) {
-            // Using the 'phrase' parse mode, Search API provides one big phrase
+            // Using the 'phrase' or 'sloppy_phrase' parse mode, Search API provides one big phrase
             // as keys. Using the 'terms' parse mode, Search API provides chunks
             // of single terms as keys. But these chunks might contain not just
             // real terms but again a phrase if you enter something like this in
@@ -711,6 +719,7 @@ class Utility {
             // three "terms" should be handled like three phrases.
             case 'terms':
             case 'phrase':
+            case 'sloppy_phrase':
             case 'edismax':
             case 'keys':
               $k[] = $queryHelper->escapePhrase(trim($key));
@@ -744,6 +753,10 @@ class Utility {
           $query_parts[] = $pre . implode(' ' . $pre, $k);
           break;
 
+        case "sloppy_phrase":
+          $sloppiness = '~10000000';
+          // No break! Execute 'default', too.
+
         case "terms":
           if (count($k) > 1 && count($fields) > 0) {
             $key_parts = [];
@@ -751,37 +764,38 @@ class Utility {
               $field_parts = [];
               foreach ($fields as $f) {
                 $field = $f;
-                $boost_or_fuzzy = '';
+                $boost = '';
                 // Split on operators:
                 // - boost (^),
                 // - fixed score (^=),
                 // - fuzzy/term proximity (~).
-                if ($split = preg_split('/([\^~])/', $f, -1, PREG_SPLIT_NO_EMPTY | PREG_SPLIT_DELIM_CAPTURE)) {
+                if ($split = preg_split('/([\^])/', $f, -1, PREG_SPLIT_NO_EMPTY | PREG_SPLIT_DELIM_CAPTURE)) {
                   $field = array_shift($split);
-                  $boost_or_fuzzy = implode('', $split);
+                  $boost = implode('', $split);
                 }
-                $field_parts[] = $field . ':' . $l . $boost_or_fuzzy;
+                $field_parts[] = $field . ':' . $l . $boost;
               }
               $key_parts[] = $pre . '(' . implode(' ', $field_parts) . ')';
             }
             $query_parts[] = '(' . implode(' ', $key_parts) . ')';
           }
-        // No break! Execute 'default', too.
+          // No break! Execute 'default', too.
+
         default:
           if (count($fields) > 0) {
             foreach ($fields as $f) {
               $field = $f;
-              $boost_or_fuzzy = '';
+              $boost = '';
               // Split on operators for boost (^), fixed score (^=), fuzzy/term proximity (~).
-              if ($split = preg_split('/([\^~])/', $f, -1, PREG_SPLIT_NO_EMPTY | PREG_SPLIT_DELIM_CAPTURE)) {
+              if ($split = preg_split('/([\^])/', $f, -1, PREG_SPLIT_NO_EMPTY | PREG_SPLIT_DELIM_CAPTURE)) {
                 $field = array_shift($split);
-                $boost_or_fuzzy = implode('', $split);
+                $boost = implode('', $split);
               }
-              $query_parts[] = $field . ':(' . $pre . implode(' ' . $pre, $k) . ')' . $boost_or_fuzzy;
+              $query_parts[] = $field . ':(' . $pre . implode(' ' . $pre, $k) . $sloppiness . ')' . $boost;
             }
           }
           else {
-            $query_parts[] = '(' . $pre . implode(' ' . $pre, $k) . ')';
+            $query_parts[] = '(' . $pre . implode(' ' . $pre, $k) . $sloppiness .')';
           }
       }
     }
diff --git a/tests/src/Kernel/SearchApiSolrTest.php b/tests/src/Kernel/SearchApiSolrTest.php
index e8571ef..cd1056b 100644
--- a/tests/src/Kernel/SearchApiSolrTest.php
+++ b/tests/src/Kernel/SearchApiSolrTest.php
@@ -249,6 +249,13 @@ class SearchApiSolrTest extends SolrBackendTestBase {
     );
     $this->assertEquals('(+"foo" +"apple pie" +"bar")', $flat);
 
+    $flat = SolrUtility::flattenKeys(
+      $query->getKeys(),
+      [],
+      'sloppy_phrase'
+    );
+    $this->assertEquals('(+"foo"~10000000 +"apple pie"~10000000 +"bar"~10000000)', $flat);
+
     $flat = SolrUtility::flattenKeys(
       $query->getKeys(),
       [],